A reduction of classical propositional logic to the conjunction-negation fragment of an intuitionistic relevant logic
نویسنده
چکیده
It is well known that the conjunction-negation fragment of the classical propositional calculus coincides with the conjunction-negation fragment of the Heyting propositional calculus (Godel, 1933; Kleene, 1952, $81). Since conjunction and negation form a sufficient basis for classical propositional logic, this reduces, in a certain sense, classical propositional logic to a fragment of Heyting propositional logic. It seems to be less well known that the same relation obtains between the classical propositional calculus and the Kolmogorov-Johansson propositional calculus usually called “minimal” (Prior, 1962, p. 259; Curry, 1963, p. 279). As a matter of fact, Kohnogorov (1925) introduced this calculus, which is properly included in Heyting’s, with the idea of obtaining some such reduction. It can be asked whether there are naturally motivated propositional calculi properly included in Kolmogorov-Johansson’s for which the same relation with the classical propositional calculus obtains. In this paper we shall present an intuitionistic relevant propositional calculus for which this is the case. Except for some trivial notational modifications, the theoretical framework of this logic is provided by Anderson and Belnap (1975).
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملCombining Possibilities and Negations
Combining non-classical or`sub-classical' logics is not easy, but it is very interesting. In this paper, we combine nonclassical logics of negation and possibility in the presence of conjunction and disjunction, and then we combine the resulting systems with intuitionistic logic. We will nd that Kracht's results on the undecidability o f classical modal logics generalise to a non-classical sett...
متن کاملNonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic
DoSen, K. Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic, Theoretical Computer Science 102 (1992) 207-214. It is shown that nonmodal classical linear first-order predicate logic based on multiplicative conjunction, additive disjunction, negation, the propositional constants and the existential quantifier is included in intuitionistic linear first-order pr...
متن کاملThe first axiomatization of relevant logic
This is a review. with historical and critical comments, of a paper b) I. E. Orlov from 1928, which eivcs the oldest known axiomatization of the implicationnegation fragment of the rclcvant logic R. Orlov’s paper also l’omshadow the modal translation of systems with an intuitionistic negation into %-type extensions of systems with a classical. involutive. negation. Orlov introduces the modal po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Philosophical Logic
دوره 10 شماره
صفحات -
تاریخ انتشار 1981